Byzantine Fault Tolerance Can Be Fast
نویسندگان
چکیده
Byzantine fault tolerance is important because it can be used to implement highly-available systems that tolerate arbitrary behaviorfrom faulty components. This paper presents a detailed performance evaluation of BFT, a state-machine replication algorithm that tolerates Byzantine faults in asynchronous systems. Our results contradict the common belief that Byzantine fault tolerance is too slow to be used in practice BFT performs well so that it can be used to iniplenient real systems. We implemented a replicated NFS file system using BFT that performs 2% faster to 24% slower than production implementations of the NFS protocol that are not fault-tolerant.
منابع مشابه
Fault Tolerance
Permanent faults : This type of failure is persistent: it continues to exist until the faulty component is repaired or replaced. Examples of this fault are disk head crashes, software bugs, and burnt-out power supplies. Any of these faults may be either a fail-silent failure (also known as a fail-stop) or a Byzantine failure. A fail-silent fault is one where the faulty unit stops functioning an...
متن کاملByzantine Fault-Tolerant Routing for Large-Scale Wireless Sensor Networks Based on Fast ECDSA
Wireless sensor networks are a favorite target of Byzantine malicious attackers because of their limited energy, low calculation capability, and dynamic topology, and other important characteristics. The Byzantine Generals Problem is one of the classical problems in the area of fault tolerance, and has wide application, especially in distributed databases and systems. There is a lot of research...
متن کاملA Robust Byzantine Fault-Tolerant Replication Technique for Peer-to-Peer Content Distribution
Problem statement: In peer-to-peer networks, Byzantine fault tolerance refers to the capability of a system to tolerate Byzantine faults. It can be achieved by replicating the server and by ensuring all server replicas reach an agreement on the input despite Byzantine faulty replicas and clients. Since malicious attacks and software errors can cause faulty nodes to exhibit Byzantine behavior, B...
متن کاملRecent Results on Fault-Tolerance Consensus in Message-Passing Networks
This paper surveys recent results on fault-tolerant consensus in message-passing networks. We focus on two categories of works: (i) new problem formulations (including input domain, fault model, network model...etc.), and (ii) practical applications. For the second part, we focus on Crash Fault-Tolerant (CFT) systems that use Paxos or Raft, and Byzantine Fault-Tolerant (BFT) systems. We also br...
متن کاملByzantine Fault Tolerant Collaborative Editing
In this paper, we describe a lightweight solution for protecting real-time collaborative editing systems against Byzantine faults. We observe that a centralized coordination algorithm not only reduces the complexity of the editing system, it makes easier to harden the system with Byzantine fault tolerance. We perform a comprehensive analysis of the potential threats towards collaborative editin...
متن کامل